In-Place Sorting with Fewer Moves
نویسندگان
چکیده
It is shown that an array of n elements can be sorted using O(1) extra space, O(n log n= log log n) element moves, and n log 2 n+O(n log log n) comparisons. This is the rst in-place sorting algorithm requiring o(n log n) moves in the worst case while guaranteeing O(n log n) comparisons, but due to the constant factors involved the algorithm is predominantly of theoretical interest.
منابع مشابه
An In-Place Sorting Algorithm Performing O(n log n) Comparisons and O(n) Data Moves
In this paper we give a positive answer to the long-standing problem of finding an in-place sorting algorithm performing O(n log n) comparisons and O(n) data moves in the worst case. So far, the better in-place sorting algorithm with O(n) moves was proposed by Munro and V. Raman. Their algorithm requires O(n) comparisons in the worst case, for any ǫ > 0. Later, Katajainen and Pasanen discovered...
متن کاملARL, a faster in-place, cache friendly sorting algorithm
This paper introduces a new, faster sorting algorithm (ARL – Adaptive Left Radix) that does in-place, non-stable sorting. Left Radix, often called MSD (Most Significant Digit) radix, is not new in itself, but the adaptive feature and the in-place sorting ability are new features. ARL does sorting with only internal moves in the array, and uses a dynamically defined radix for each pass. ALR is a...
متن کاملFast Stable In - Place Sorting with O ( n ) Data Moves 1
Until recently, it was not known whether it was possible to sort stably (i.e., keeping equal elements in their initial order) an array of n elements using only O(n) data moves and O(1) extra space. In [13] an algorithm was given to perform this task in O(n2) comparisons in the worst case. Here, we develop a new algorithm for the problem that performs only O(n1+ε) comparisons (0 < ε ≤ 1 is any f...
متن کاملAutomation of Object Sorting System Using Pick & Place Robotic Arm & Image Processing
The paper presents a smart approach for a real time inspection and selection of objects in continuous flow. Image processing in today’s world grabs massive attentions as it leads to possibilities of broaden application in many fields of high technology. The real challenge is how to improve existing sorting system in the modular processing system which consists of four integrated stations of ide...
متن کاملSorting a Permutation with Block Moves
We prove a lower and an upper bound on the number of block moves necessary to sort a permutation. We put our results in contrast with existing results on sorting by block transpositions, and raise some open questions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 70 شماره
صفحات -
تاریخ انتشار 1999